Probabilistic inference and ranking of gene regulatory pathways as a shortest-path problem
نویسندگان
چکیده
منابع مشابه
Whisker detection as a shortest path problem
In an attempt to understand how the brain encodes tactile stimuli, neuroscientists commonly investigate how rodents translate whisker motion into a sensory percept. Analysis of whisker dynamics is a challenging task. Rats, have about 30 whiskers per side and in single-viewing angle experiments, occlusion and intersection occur frequently. In this paper we present an unsupervised method for whis...
متن کاملShortest Path Based Decision Making Using Probabilistic Inference
We present a new perspective on the classical shortest path routing (SPR) problem in graphs. We show that the SPR problem can be recast to that of probabilistic inference in a mixture of simple Bayesian networks. Maximizing the likelihood in this mixture becomes equivalent to solving the SPR problem. We develop the well known Expectation-Maximization (EM) algorithm for the SPR problem that maxi...
متن کاملFuzzy Shortest Path Problem Based on Index Ranking
The Shortest path problem is a classical network optimisation problem which has wide range of applications in various fields. In this work, we study the task of finding the shortest path in fuzzy weighted graph (network) i.e., vertices remains crisp, but the edge weights will be of fuzzy numbers. It has been proposed to present new algorithms for finding the shortest path in fuzzy sense where i...
متن کاملShortest Path Problem with Gamma Probability Distribution Arc Length
We propose a dynamic program to find the shortest path in a network having gamma probability distributions as arc lengths. Two operators of sum and comparison need to be adapted for the proposed dynamic program. Convolution approach is used to sum two gamma probability distributions being employed in the dynamic program.
متن کاملA New Ranking Path Algorithm for the Multi-objective Shortest Path Problem
In this paper, we present a new algorithm for solving the multi-objective shortest path problem (MSPP) which consists of finding all the non-dominated paths between two nodes s and t (ND s-t paths), on a network where a multiple criteria function is defined over the set of arcs. The main feature of the algorithm is that, contrarily to the previous most efficient approaches for the MSPP, not all...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BMC Bioinformatics
سال: 2013
ISSN: 1471-2105
DOI: 10.1186/1471-2105-14-s13-s5